Primes with an Average Sum of Digits
نویسندگان
چکیده
The main goal of this paper is to provide asymptotic expansions for the numbers #{p 6 x : p prime, sq(p) = k} for k close to ((q − 1)/2) logq x, where sq(n) denotes the q-ary sum-of-digits function. The proof is based on a thorough analysis of exponential sums of the form ∑ p6x e(αsq(p)) (the sum is restricted to p prime), where we have to extend a recent result by the second two authors.
منابع مشابه
Counting Primes whose Sum of Digits is Prime
Motivated by recent work of Drmota, Mauduit and Rivat, we discuss the possibility of counting the number of primes up to x whose sum of digits is also prime. We show that, although this is not possible unless we assume a hypothesis on the distribution of primes stronger than what is implied by the Riemann hypothesis, we can establish a Mertens-type result. That is, we obtain a formula for the n...
متن کاملPrimes whose sum of digits is prime and metric number theory
It is shown that almost all real x contain infinitely many primes in their decimal expansions (to any base) whose sum of digits is also prime, generalising a previous result by the author. To do this, the earlier method in metric number theory is combined with recent work by Drmota, Mauduit and Rivat on primes with prescribed sum of digits.
متن کاملThe sum of digits of primes in Z[i]
We study the distribution of the complex sum-of-digits function sq with basis q = −a ± i, a ∈ Z+ for Gaussian primes p. Inspired by a recent result of Mauduit and Rivat [16] for the real sum-of-digits function, we here get uniform distribution modulo 1 of the sequence (αsq(p)) provided α ∈ R \Q and q is prime with a ≥ 28. We also determine the order of magnitude of the number of Gaussian primes...
متن کاملDesign and Synthesis of High Speed Low Power Signed Digit Adders
Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to {–1, 0, 1}, and finally adding the tra...
متن کاملDismal Arithmetic
Dismal arithmetic is just like the arithmetic you learned in school, only simpler: there are no carries, when you add digits you just take the largest, and when you multiply digits you take the smallest. This paper studies basic number theory in this world, including analogues of the primes, number of divisors, sum of divisors, and the partition function.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008